A 588-Gb/s LDPC Decoder Based on Finite-Alphabet Message Passing
نویسندگان
چکیده
منابع مشابه
Partially-Parallel LDPC Decoder Achieving High-Efficiency Message-Passing Schedule
In this paper, we propose a partially-parallel LDPC decoder which achieves a high-efficiency message-passing schedule. The proposed LDPC decoder is characterized as follows: (i) The column operations follow the row operations in a pipelined architecture to ensure that the row and column operations are performed concurrently. (ii) The proposed parallel pipelined bit functional unit enables the c...
متن کاملFPGA Implementation of a LDPC Decoder using a Reduced Complexity Message Passing Algorithm
In this paper, a simplified message passing algorithm for decoding Low-Density Parity-Check (LDPC) codes is proposed with a view to reduce the implementation complexity. The algorithm is based on simple hard-decision decoding techniques while utilizing the advantages of soft channel information to improve decoder performance. It has been validated through simulation using LDPC code compliant wi...
متن کاملA Cycle Search Algorithm Based on a Message-Passing for the Design of Good LDPC Codes
A cycle search algorithm based on a message-passing in a Tanner graph is proposed for designing good LDPC codes. By applying the message-passing algorithm with a message alphabet composed of only two messages to a cycle search, we can perform a cycle search with less computational complexity than tree-based search algorithms. Also, the proposed algorithm can be easily implemented by using an ex...
متن کاملGraph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes
The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in maximum-likelihood decoding all codewords in a code are competing to be the best explanation of the received vector, under graph-cover decoding all codewords...
متن کاملEfficient Sparse Code Multiple Access Decoder Based on Deterministic Message Passing Algorithm
Being an effective non-orthogonal multiple access (NOMA) technique, sparse code multiple access (SCMA) is promising for future wireless communication. Compared with orthogonal techniques, SCMA enjoys higher overloading tolerance and lower complexity because of its sparsity. In this paper, based on deterministic message passing algorithm (DMPA), algorithmic simplifications such as domain changin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
سال: 2018
ISSN: 1063-8210,1557-9999
DOI: 10.1109/tvlsi.2017.2766925